A pointed Delaunay pseudo-triangulation of a simple polygon
نویسندگان
چکیده
We present a definition of a pointed Delaunay pseudotriangulation of a simple polygon. We discuss why our definition is reasonable. Our approach will be motivated from maximal locally convex functions, and extends the work of Aichholzer et al.[1]. Connections between the polytope of the pointed pseudotriangulations and the Delaunay pseudo-triangulation will be given.
منابع مشابه
Enumerating pseudo-triangulations in the plane
A pseudo-triangle is a simple polygon with exactly three convex vertices. A pseudo-triangulation of a finite point set S in the plane is a partition of the convex hull of S into interior disjoint pseudo-triangles whose vertices are points of S. A pointed pseudo-triangulation is one which has the least number of pseudo-triangles. We study the graph G whose vertices represent the pointed pseudo-t...
متن کاملAn Overview of Triangulation Algorithms for Simple Polygons
Decomposing simple polygon into simpler components is one of the basic tasks in computational geometry and its applications. The most important simple polygon decomposition is triangulation. Different techniques for triangulating simple polygon were designed. The first part of the paper is an overview of triangulation algorithms based on diagonal inserting. In the second part we present algorit...
متن کاملA Contribution to Triangulation Algorithms for Simple Polygons
Decomposing simple polygon into simpler components is one of the basic tasks in computational geometry and its applications. The most important simple polygon decomposition is triangulation. The known algorithms for polygon triangulation can be classified into three groups: algorithms based on diagonal inserting, algorithms based on Delaunay triangulation, and the algorithms using Steiner point...
متن کاملResolving Loads with Positive Interior Stresses
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometric graph on the points pi that has the following property: There exists a weight assignment to the edges of the graph, such that for every pi the sum of the weighted edges (seen as vectors) around pi yields −fi. As add...
متن کاملDegree Bounds for Constrained Pseudo-Triangulations
We introduce the concept of a constrained pointed pseudo-triangulation TG of a point set S with respect to a pointed planar straight line graph G = (S,E). For the case that G forms a simple polygon P with vertex set S we give tight bounds on the vertex degree of TG.
متن کامل